Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Binary code")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 1372

  • Page / 55
Export

Selection :

  • and

Lower bounds for binary codes of covering radius oneHAAS, Wolfgang.IEEE transactions on information theory. 2007, Vol 53, Num 8, pp 2880-2881, issn 0018-9448, 2 p.Article

Two new binary codes with minimum distance threeHAMALAINEN, H.IEEE transactions on information theory. 1988, Vol 34, Num 4, issn 0018-9448, 875Article

Codes and length-increasing transitive binary relationsDO LONG VAN; KIEU VAN HUNG; PHAN TRUNG HUY et al.Lecture notes in computer science. 2005, pp 29-48, issn 0302-9743, isbn 3-540-29107-5, 1Vol, 20 p.Conference Paper

Two's complement extension of a parallel binary division by tenPETRY, F. E.Electronics Letters. 1983, Vol 19, Num 18, pp 718-720, issn 0013-5194Article

An extension of an inequality by ahlswede, El Gamal and Pang for pairs of binary codesDELSARTE, P; PIRET, P.Discrete mathematics. 1985, Vol 55, Num 3, pp 313-315, issn 0012-365XArticle

Projective codes meeting the Griesmer boundHELLESETH, T.Discrete mathematics. 1992, Vol 106-7, pp 265-271, issn 0012-365XArticle

On vectors of weight 16 in the code of a projective plane of order 10PRINCE, A. R.Proceedings of the Royal Society of Edinburgh. Section A. Mathematics. 1983, Vol 95, Num 1-2, pp 137-146, issn 0308-2105Article

Coding scheme for a wire-tap channel using regular codesHUGUET, L.Discrete mathematics. 1985, Vol 56, Num 2-3, pp 191-201, issn 0012-365XArticle

On Non-binary quantum BCH codesZHI MA; XIN LU; KEQIN FENG et al.Lecture notes in computer science. 2006, pp 675-683, issn 0302-9743, isbn 3-540-34021-1, 1Vol, 9 p.Conference Paper

The equivalence of certain equidistant binary codes and symmetric bibdsSTINSON, D. R; VAN REES, G. H. J.Combinatorica (Print). 1984, Vol 4, Num 4, pp 357-362, issn 0209-9683Article

On non-antipodal binary completely regular codesBORGES, J; RIFA, J; ZINOVIEV, V. A et al.Discrete mathematics. 2008, Vol 308, Num 16, pp 3508-3525, issn 0012-365X, 18 p.Article

On the Number of 1-Perfect Binary Codes : A Lower BoundKROTOV, Denis S; AVGUSTINOVICH, Sergey V.IEEE transactions on information theory. 2008, Vol 54, Num 4, pp 1760-1765, issn 0018-9448, 6 p.Article

There Is No Binary [35, 10, 13] CodeTJHAI, Cen J; TOMLINSON, Martin; GRASSL, Markus et al.IEEE transactions on information theory. 2011, Vol 57, Num 9, pp 6094-6096, issn 0018-9448, 3 p.Article

On a lower bound on the number of perfect binary codesMALYUGIN, S. A.Discrete applied mathematics. 2004, Vol 135, Num 1-3, pp 157-160, issn 0166-218X, 4 p.Article

Some results for linear binary codes with minimum distance 5 and 6BOUYUKLIEV, Iliya; VARBANOV, Zlatko.IEEE transactions on information theory. 2005, Vol 51, Num 12, pp 4387-4391, issn 0018-9448, 5 p.Article

Information Sets From Defining Sets in Abelian CodesJOAQUIN BERNAL, José; JACOBO SIMON, Juan.IEEE transactions on information theory. 2011, Vol 57, Num 12, pp 7990-7999, issn 0018-9448, 10 p.Article

Practical construction of binary codes and its decodingHUBER, K.AEU. Archiv für Elektronik und Übertragungstechnik. 1991, Vol 45, Num 1, pp 55-57, issn 0001-1096, 3 p.Article

Bounds and constructions for binary codes of length less than 24 and asymmetric distance less than 6WEBER, J. H; DE VROEDT, C; BOEKEE, D. E et al.IEEE transactions on information theory. 1988, Vol 34, Num 5, pp 1321-1331, issn 0018-9448Article

A note on perfect arithmetic codesASTOLA, J.IEEE transactions on information theory. 1986, Vol 32, Num 3, pp 443-445, issn 0018-9448Article

Binary sequence with a high crosscorrelation with each member of a subset of gold codesYATES, K. W; BEACH, M. A; COPPING, A. J et al.Electronics Letters. 1986, Vol 22, Num 18, pp 930-932, issn 0013-5194Article

On certain projective geometry codesHUANG, J. F; SHIVA, S. G. S; SEGUIN, G et al.IEEE transactions on information theory. 1984, Vol 30, Num 2, pp 385-388, issn 0018-9448Article

The complexity of computing the coverning radius of a codeLOUGHLIN, A. M. M.IEEE transactions on information theory. 1984, Vol 30, Num 6, pp 800-804, issn 0018-9448Article

Efficient exhaustive search for optimal-peak-sidelobe binary codesCOXSON, Greg; RUSSO, Jon.IEEE Radar Conference. 2004, pp 438-443, isbn 0-7803-8234-X, 6 p.Conference Paper

On minimal decoding sets for the extended binary golay codeANDERSON, J. L.IEEE transactions on information theory. 1992, Vol 38, Num 5, pp 1560-1561, issn 0018-9448Article

Extremal self-dual codes from symmetric designsSPENCE, E; TONCHEV, V. D.Discrete mathematics. 1992, Vol 110, Num 1-3, pp 265-268, issn 0012-365XArticle

  • Page / 55